Fitting a Bandlimited Curve to Points in a Plane

نویسندگان

  • Daniel Beylkin
  • Vladimir Rokhlin
چکیده

of m points while providing the user a high level of control over the frequency content of the resulting curve. Specifically, the algorithm views the tangential angle of the curve as a function of the arc-length, filters it as such, and adds a small analytic perturbation so that the curve passes through the input data. If the number of nodes in the initial discretization is n, the entire scheme has asymptotic complexity O(n log n). The resulting curve is analytic and bandlimited. The performance of the scheme is illustrated with several numerical examples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

We Fitting a Bandlimited Curve to Points in a Plane

of m points while providing the user a high level of control over the frequency content of the resulting curve. Specifically, the algorithm views the tangential angle of the curve as a function of the arc-length, filters it as such, and adds a small analytic perturbation so that the curve passes through the input data. If the number of nodes in the initial discretization is n, the entire scheme...

متن کامل

Capturing Outlines of Planar Generic Images by Simultaneous Curve Fitting and Sub-division

In this paper, a new technique has been designed to capture the outline of 2D shapes using cubic B´ezier curves. The proposed technique avoids the traditional method of optimizing the global squared fitting error and emphasizes the local control of data points. A maximum error has been determined to preserve the absolute fitting error less than a criterion and it administers the process of curv...

متن کامل

Fitting rectilinear polygonal curves to a set of points in the plane

In this paper two problems of ®tting rectilinear polygonal curves to a set of points in the plane according to the minimax approximation are considered. The constraints are, respectively, on the number of vertices and length of the polygonal curve. In both cases ecient algorithms are developed.

متن کامل

مدل‌سازی صفحه‌ای محیط‌های داخلی با استفاده از تصاویر RGB-D

In robotic applications and especially 3D map generation of indoor environments, analyzing RGB-D images have become a key problem. The mapping problem is one of the most important problems in creating autonomous mobile robots. Autonomous mobile robots are used in mine excavation, rescue missions in collapsed buildings and even planets’ exploration. Furthermore, indoor mapping is beneficial in f...

متن کامل

Degree Reduction of Disk Wang-Bézier Type Generalized Ball Curves

A disk Wang-Bézier type generalized Ball curve is a Wang-Bézier type generalized Ball curve whose control points are disks in a plane. It can be viewed as a parametric curve with error tolerances. In this paper, we discuss the problem of degree reduction of disk Wang-Bézier type generalized Ball curve, that is, bounding disk Wang-Bézier type generalized Ball curves with lower degree disk Wa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2014